Finding Minimum Area k-gons
نویسندگان
چکیده
Given a set P of n points in the plane and a number k, we want to find a polygon ~ with vertices in P of minimum area that satisfies one of the following properties: (1) cK is a convex k-gon, (2) ~ is an empty convex k-gon, or (3) ~ is the convex hull of exactly k points of P. We give algorithms for solving each of these three problems in time O(kn3). The space complexity is O(n) for k = 4 and O(kn 2) for k > 5. The algorithms are based on a dynamic ptogramming approach. We generalize this approach to polygons with minimum perimeter, polygons with maximum perimeter or area, polygons containing the maximum or minimum number of points, polygons with minimum weight (for some weights added to vertices), etc., in similar
منابع مشابه
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q ⊂ P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of finding a minimum area convex k-gon, in time O(n log n) and space O(n log n) for fixed k, almost matching known bounds for the minimum area triangle problem. Our algorithm is based on finding a certain number of nearest...
متن کاملAn Optimal Algorithm for Finding Minimal Enclosing Triangles
The problems of circumscribing and inscribing convex polygons with, respectively, minimum and maximum area k-gons have been studied extensively in the recent past because of their applications to robotics and collision avoidance problems [CY, DA]. In particular, Klee and Laskowski [KL] have given an O(n log%) algorithm for finding all local minima (with respect to area) among the triangles that...
متن کاملThe minimum area of a simple polygon with given side lengths
Answering a question of H. Harborth, for any given a1, ..., an > 0, satisfying ai < ∑ j 6=i aj we determine the infimum of the areas of the simple n–gons in the Euclidean plane, having sides of length a1, ..., an (in some order). The infimum is attained (in limit) if the polygon degenerates into a certain kind of triangle, plus some parts of zero area. We show the same result for simple polygon...
متن کاملOn empty pentagons and hexagons in planar point sets
We give improved lower bounds on the minimum number of k-holes (empty convex k-gons) in a set of n points in general position in the plane, for k = 5, 6.
متن کاملDowker-type theorems for hyperconvex discs
A hyperconvex disc of radius r is a planar set with nonempty interior that is the intersection of closed circular discs of radius r. A convex disc-polygon of radius r is a set with nonempty interior that is the intersection of a finite number of closed circular discs of radius r. We prove that the maximum area and perimeter of convex disc-n-gons of radius r contained in a hyperconvex disc of ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 7 شماره
صفحات -
تاریخ انتشار 1992